Binary patterns in binary cube-free words: Avoidability and growth
نویسندگان
چکیده
منابع مشابه
Binary patterns in binary cube-free words: Avoidability and growth
The avoidability of binary patterns by binary cube-free words is investigated and the exact bound between unavoidable and avoidable patterns is found. All avoidable patterns are shown to be D0L-avoidable. For avoidable patterns, the growth rates of the avoiding languages are studied. All such languages, except for the overlap-free language, are proved to have exponential growth. The exact growt...
متن کاملAvoidability Index for Binary Patterns with Reversal
For every pattern p over the alphabet {x, y, x, y}, we specify the least k such that p is k-avoidable.
متن کاملConstructing Premaximal Binary Cube-Free Words of any Level
The study of repetition-free words and languages remains quite popular in combinatorics of words: lots of interesting and challenging problems are still open. The most popular repetition-free binary languages are the cube-free language CF and the overlap-free language OF. The language CF is much bigger and has much more complicated structure. For example, the number of overlap-free binary words...
متن کاملCounting Overlap-Free Binary Words
A word on a nite alphabet A is said to be overlap free if it contains no factor of the form xuxux where x is a letter and u a possibly empty word In this paper we study the number un of overlap free binary words of length n which is known to be bounded by a polynomial in n First we describe a bijection between the set of overlap free words and a rational language This yields recurrence relation...
متن کاملPolynomial versus exponential growth in repetition-free binary words
It is known that the number of overlap-free binary words of length n grows polynomially, while the number of cubefree binary words grows exponentially. We show that the dividing line between polynomial and exponential growth is 73 . More precisely, there are only polynomially many binary words of length n that avoid 7 3 -powers, but there are exponentially many binary words of length n that avo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 2014
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/2014015